Intuitionistic Hypothetical Logic of Proofs
نویسندگان
چکیده
منابع مشابه
Intuitionistic Hypothetical Logic of Proofs
We study a term assignment for an intuitonistic fragment of the Logic of Proofs (LP). LP is a refinement of modal logic S4 in which the assertion 2A is replaced by [[s]]A whose intended reading is “s is a proof of A”. We first introduce a natural deduction presentation based on hypothetical judgements and then its term assignment, which yields a confluent and strongly normalising typed lambda c...
متن کاملHypothetical Logic of Proofs
The Logic of Proofs (LP) [2–5] is a refinement of modal logic introduced by Artemov in 1995 which has recently been proposed for explaining well-known paradoxes arising in the formalization of Epistemic Logic. Assertions of knowledge and belief are accompanied by justifications: the formula [[t]]A states that proof witness t is “reason” for knowing/believing A. Also, LP is capable of reflecting...
متن کاملIntuitionistic Logic of Proofs
The logic of proofs LP was introduced in [3] and thoroughly studied in [1]. LP is a natural extension of the propositional calculus in the language representing proofs as formal objects. Proof expressing terms are constructed using constants, variables, and symbols of natural operations on derivations. Then formula t :F has the intended interpretation “t is a proof of F”. LP is complete with re...
متن کاملHypothetical Reasoning with Intuitionistic Logic
This paper addresses a limitation of most deductive database systems: They cannot reason hypothetically. Although they reason eeectively about the world as it is, they are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. To address this limitation, this paper presents a logic-programming language in which a user can cr...
متن کاملThe basic intuitionistic logic of proofs
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F . In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2014
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2013.12.013